Noise Processing for Simple Laplacian Pyramid Synthesis Based on Dual Frame Reconstruction

نویسندگان

  • Aditya Mavlankar
  • David Chen
  • Sameh Zakhary
  • Markus Flierl
  • Bernd Girod
چکیده

The Laplacian pyramid (LP) provides a frame expansion. Thus, there exist infinitely many synthesis operators which achieve perfect reconstruction in the absence of quantization. However, if the subbands are quantized in the open-loop mode then the dual frame synthesis operator, which is the pseudo-inverse of the analysis operator, minimizes the mean squared error (MSE) in the reconstruction. Note that this requires modification of the conventional simple synthesis scheme. For the open-loop mode, we propose novel quantization noise processing at the encoder that allows us to achieve the same performance as dual frame reconstruction and yet retain the simple synthesis scheme at the decoder. This has the advantage that the decoder can be simple in structure as well as be agnostic of whether the encoder was open-loop or closed-loop and achieves minimum MSE reconstruction for both cases. Experimental results show a gain of around 1 dB with the dual frame reconstruction compared to the simple synthesis operator. Furthermore, experiments confirm that this gain can also be obtained by retaining the simple synthesis operator and performing the proposed quantization noise processing at the encoder.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Framing pyramids

In 1983, Burt and Adelson introduced the Laplacian pyramid (LP) as a multiresolution representation for images. We study the LP using the frame theory, and this reveals that the usual reconstruction is suboptimal. We show that the LP with orthogonal filters is a tight frame, and thus, the optimal linear reconstruction using the dual frame operator has a simple structure that is symmetric with t...

متن کامل

Frame reconstruction of the Laplacian pyramid

We study the Laplacian pyramid (LP) as a frame operator, and this reveals that the usual reconstruction is suboptimal. With orthogonal filters, the LP is shown to be a tight frame, thus the optimal linear reconstruction using the dual frame operator has a simple structure as symmetrical with the forward transform. For more general cases, we propose an efficient filter bank for reconstruction in...

متن کامل

Restoration of Ultrasound Images by Nonlinear Scale{space Filtering

The quality of ultrasound images is limited by granular speckle noise. This paper presents two nonlinear restoration methods based on multiscale signal decomposition. Initially, signal{dependent multiplicative speckle noise is transformed to additive noise by a logarithm point operation. Rectangular coordinates are obtained by a polar coordinate transform of the sector image. The lateral distor...

متن کامل

2 5 M ay 2 01 1 Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration ∗

A fruitful approach for solving signal deconvolution problems consists of resorting to a framebased convex variational formulation. In this context, parallel proximal algorithms and related alternating direction methods of multipliers have become popular optimization techniques to approximate iteratively the desired solution. Until now, in most of these methods, either Lipschitz differentiabili...

متن کامل

Multiple Image Fusion Using Laplacian Pyramid

Image fusion is an important visualization technique of integrating coherent spatial and temporal information into a compact form. Laplacian fusion is a process that combines regions of images from different sources into a single fused image based on a salience selection rule for each region. In this paper, we proposed an algorithmic approach using a Laplacian and Gaussian pyramid to better loc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007